package algorithm.leetcode;

public class LeetCode_406_reconstructQueue {
    public int[][] reconstructQueue(int[][] people) {
        int[][] res = new int[people.length][people[0].length];
        return res;
    }

    public static void main(String[] args) {

    }
}
